Near-optimal solutions to large-scale facility location problems
نویسندگان
چکیده
منابع مشابه
Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems
Single Machine Scheduling Problems with Release Dates (SMSP) concern the optimal allocation of a set of jobs on a single machine, that cannot process more than one job at a time. Each job is ready for processing at a release date and it has to be processed without interruption. The goal is to minimize the total weighted completion time of the jobs. In this paper the time-indexed formulation is ...
متن کاملAn effective heuristic for large-scale capacitated facility location problems
The Capacitated Facility Location Problem (CFLP) consists of locating a set of facilities with capacity constraints to satisfy the demands of a set of clients at the minimum cost. In this paper we propose a simple and effective heuristic for largescale instances of CFLP. The heuristic is based on a Lagrangean relaxation which is used to select a subset of “promising” variables forming the core ...
متن کاملA heuristic method for large-scale multi-facility location problems
A heuristic method for solving large-scale multi–facility location problems is presented. The method is analogous to Cooper’s method [3], using the authors’ single facility location method [20] as a parallel subroutine, and reassigning customers to facilities using the heuristic of Nearest Center Reclassification. Numerical results are reported.
متن کاملProvably near-optimal solutions for very large single-row facility layout problems
The facility layout problem is a global optimization problem that seeks to arrange a given number of rectangular facilities so as to minimize the total cost associated with the (known or projected) interactions between them. This paper is concerned with the single-row facility layout problem (SRFLP), the one-dimensional version of facility layout that is also known as the one-dimensional space ...
متن کاملOptimal Group Manipulation in Facility Location Problems
We address optimal group manipulation in multidimensional, multi-facility location problems. We focus on two families of mechanisms, generalized median and quantile mechanisms, evaluating the difficulty of group manipulation of these mechanisms. We show that, in the case of single-facility problems, optimal group manipulation can be formulated as a linear or second-order cone program, under the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2005
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2003.03.001